Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs
نویسنده
چکیده
We show that the characteristic functions of linear codes are exponentially hard for the model of oblivious read-once branching programs with parity accepting mode, known also as Parity OBDDs. The proof is extremely simple, and employs a particular combinatorial property of linear codes { their universality.
منابع مشابه
Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs
We prove the first lower bound for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is still a challenging open problem. The following variant of read–once parity branching programs is well–motivated. Le...
متن کاملLower bounds for restricted read-once parity branching programs
We prove the first lower bounds for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is an important open problem. The following variant is well–motivated more general than variants for that lower bounds...
متن کاملParity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Branching programs are a well-established computation model for boolean functions, especially read-once branching programs have been studied intensively. Exponential lower bounds for deterministic and nondeterministic read-once branching programs are known for a long time. On the other hand, the problem of proving superpolynomial lower bounds for parity read-once branching programs is still ope...
متن کاملA very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
Branching programs are a well-established computation model for boolean functions, especially read-once branching programs (BP1s) have been studied intensively. A very simple function f in n variables is exhibited such that both the function f and its negation ¬f can be computed by Σ p-circuits, the function f has nondeterministic BP1s (with one nondeterministic node) of linear size and ¬f has ...
متن کاملPseudorandomness for Regular Branching Programs via Fourier Analysis
We present an explicit pseudorandom generator for oblivious, read-once, permutation branching programs of constant width that can read their input bits in any order. The seed length is O(log n), where n is the length of the branching program. The previous best seed length known for this model was n, which follows as a special case of a generator due to Impagliazzo, Meka, and Zuckerman (FOCS 201...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 69 شماره
صفحات -
تاریخ انتشار 1999